Optimal algorithms for ranked enumeration of answers to full conjunctive queries
نویسندگان
چکیده
منابع مشابه
Generalizing Conjunctive Queries for Informative Answers
Deductive generalization of queries is one method to provide informative answers to failing queries. We analyze properties of operators that generalize conjunctive queries consisting of positive as well as negative literals. We show that for the stepwise combination of these operators it suffices to apply the operator in one certain order.
متن کاملConsistent Answers of Conjunctive Queries on Graphs
During the past decade, there has been an extensive investigation of the computational complexity of the consistent answers of Boolean conjunctive queries under primary key constraints. Much of this investigation has focused on self-join-free Boolean conjunctive queries. In this paper, we study the consistent answers of Boolean conjunctive queries involving a single binary relation, i.e., we co...
متن کاملEfficient homomorphism-free enumeration of conjunctive queries
Many algorithms in the field of inductive logic programming rely on a refinement operator satisfying certain desirable properties. Unfortunately, for the space of conjunctive queries under θ-subsumption, no optimal refinement operator exists. In this paper, we argue that this does not imply that frequent pattern mining in this setting can not be efficient. As an example, we consider the problem...
متن کاملTractable Counting of the Answers to Conjunctive Queries
Conjunctive queries (CQs) are one of the most fundamental forms of database queries. In general, the evaluation of CQs is NPcomplete. Consequently, there has been an intensive search for tractable fragments. In this paper, we want to initiate a systematic search for tractable fragments of the counting problem of CQs, i.e., the problem of counting the answers to a CQ. We prove several new tracta...
متن کاملConstant Delay Enumeration for Acyclic Conjunctive Queries over X Structures
We present an efficient answer enumeration algorithm for an extension of Conditional XPath with variables, which is a first-order complete query language for unranked trees of bounded depth. Our algorithm requires constant delay and linear preprocessing time for fixed queries, while depending linearly on the size of the query. It is based on a new enumeration algorithm for disjunctions of acycl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the VLDB Endowment
سال: 2020
ISSN: 2150-8097
DOI: 10.14778/3397230.3397250